Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("KIVINEN, Jyrki")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 32

  • Page / 2
Export

Selection :

  • and

COLT 2002 : computational learning theory (Sydney, 8-10 July 2002)Kivinen, Jyrki; Sloan, Robert H.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43836-X, XI, 395 p, isbn 3-540-43836-XConference Proceedings

Performance guarantees for hierarchical clusteringDASGUPTA, Sanjoy.Lecture notes in computer science. 2002, pp 351-363, issn 0302-9743, isbn 3-540-43836-X, 13 p.Conference Paper

Learning tree languages from textFERNAU, Henning.Lecture notes in computer science. 2002, pp 153-168, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

New lower bounds for Statistical Query learningKE YANG.Lecture notes in computer science. 2002, pp 229-243, issn 0302-9743, isbn 3-540-43836-X, 15 p.Conference Paper

The Speed prior: A new simplicity measure yielding near-optimal computable predictionsSCHMIDHUBER, Jiirgen.Lecture notes in computer science. 2002, pp 216-228, issn 0302-9743, isbn 3-540-43836-X, 13 p.Conference Paper

The p-norm generalization of the LMS algorithm for adaptive filteringKIVINEN, Jyrki; WARMUTH, Manfred K; HASSIBI, Babak et al.IEEE transactions on signal processing. 2006, Vol 54, Num 5, pp 1782-1793, issn 1053-587X, 12 p.Article

Online learning of linear classifiersKIVINEN, Jyrki.Lecture notes in computer science. 2003, pp 235-257, issn 0302-9743, isbn 3-540-00529-3, 23 p.Conference Paper

Merging uniform inductive learnersZILLES, Sandra.Lecture notes in computer science. 2002, pp 201-215, issn 0302-9743, isbn 3-540-43836-X, 15 p.Conference Paper

Tracking linear-threshold concepts with WinnowMESTERHARM, Chris.Lecture notes in computer science. 2002, pp 138-152, issn 0302-9743, isbn 3-540-43836-X, 15 p.Conference Paper

Self-optimizing and pareto-optimal policies in general environments based on bayes-mixturesHUTTER, Marcus.Lecture notes in computer science. 2002, pp 364-379, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

Geometric parameters of kernel machinesMENDELSON, Shahar.Lecture notes in computer science. 2002, pp 29-43, issn 0302-9743, isbn 3-540-43836-X, 15 p.Conference Paper

Entropy, combinatorial dimensions and random averagesMENDELSON, Shahar; VERSHYNIN, Roman.Lecture notes in computer science. 2002, pp 14-28, issn 0302-9743, isbn 3-540-43836-X, 15 p.Conference Paper

Inferring deterministic linear languagesDE LA HIGUERA, Colin; ONCINA, Jose.Lecture notes in computer science. 2002, pp 185-200, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

Prediction and dimensionFORTNOW, Lance; LUTZ, Jack H.Lecture notes in computer science. 2002, pp 380-395, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

Mixability and the existence of weak complexitiesKALNISHKAN, Yuri; VYUGIN, Michael V.Lecture notes in computer science. 2002, pp 105-120, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

A consistent strategy for boosting algorithmsLUGOSI, Gabor; VAYATIS, Nicolas.Lecture notes in computer science. 2002, pp 303-318, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

Path kernels and multiplicative updatesTAKIMOTO, Eiji; WARMUTH, Manfred K.Lecture notes in computer science. 2002, pp 74-89, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

On the proper learning of axis parallel conceptsBSHOUTY, Nader H; BURROUGHS, Lynn.Lecture notes in computer science. 2002, pp 287-302, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

Bounds for the minimum disagreement problem with applications to learning theoryBSHOUTY, Nader H; BURROUGHS, Lynn.Lecture notes in computer science. 2002, pp 271-286, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

Agnostic learning nonconvex function classesMENDELSON, Shahar; WILLIAMSON, Robert C.Lecture notes in computer science. 2002, pp 1-13, issn 0302-9743, isbn 3-540-43836-X, 13 p.Conference Paper

Maximizing the margin with boostingRÄTSCH, Gunnar; WARMUTH, Manfred K.Lecture notes in computer science. 2002, pp 334-350, issn 0302-9743, isbn 3-540-43836-X, 17 p.Conference Paper

Localized rademacher complexitiesBARTLETT, Peter L; BOUSQUET, Olivier; MENDELSON, Shahar et al.Lecture notes in computer science. 2002, pp 44-58, issn 0302-9743, isbn 3-540-43836-X, 15 p.Conference Paper

The consistency of greedy algorithms for classificationMANNORL, Shie; MEIR, Ron; TONG ZHANG et al.Lecture notes in computer science. 2002, pp 319-333, issn 0302-9743, isbn 3-540-43836-X, 15 p.Conference Paper

Exploring learnability between Exact and PACBSHOUTY, Nader H; JACKSON, Jeffrey C; TAMON, Christino et al.Lecture notes in computer science. 2002, pp 244-254, issn 0302-9743, isbn 3-540-43836-X, 11 p.Conference Paper

A second-order Perceptron algorithmCESA-BIANCHI, Nicolo; CONCONI, Alex; GENTILE, Claudio et al.Lecture notes in computer science. 2002, pp 121-137, issn 0302-9743, isbn 3-540-43836-X, 17 p.Conference Paper

  • Page / 2